翻訳と辞書
Words near each other
・ Deadline (Grant novel)
・ Deadline (magazine)
・ Deadline (Marvel Comics)
・ Deadline (science fiction story)
・ Deadline (split album)
・ Deadline (video game)
・ Deadline at Dawn
・ Deadline Auto Theft
・ Deadline for Love and Other Stories
・ Deadline for My Memories
・ Deadline Gallipoli
・ Deadline Games
・ Deadline scheduler
・ Deadline – Jede Sekunde zählt
・ Deadline – U.S.A.
Deadline-monotonic scheduling
・ Deadline.com
・ Deadline24
・ Deadlines (Arkells album)
・ Deadlines (Strawbs album)
・ Deadlock
・ Deadlock (1931 film)
・ Deadlock (1943 film)
・ Deadlock (1970 film)
・ Deadlock (band)
・ Deadlock (Battlestar Galactica)
・ Deadlock (disambiguation)
・ Deadlock (game theory)
・ Deadlock (novel)
・ Deadlock prevention algorithms


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Deadline-monotonic scheduling : ウィキペディア英語版
Deadline-monotonic scheduling

Deadline-monotonic priority assignment is a priority assignment policy used with fixed priority pre-emptive scheduling.
With deadline-monotonic priority assignment, tasks are assigned priorities according to their deadlines; the task with the shortest deadline being assigned the highest priority.〔(【引用サイトリンク】url=http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.8928 )
This priority assignment policy is optimal for a set of periodic or sporadic tasks which comply with the following restrictive system model:
# All tasks have deadlines less than or equal to their minimum inter-arrival times (or periods).
# All tasks have worst-case execution times (WCET) that are less than or equal to their deadlines.
# All tasks are independent and so do not block each other's execution (for example by accessing mutually exclusive shared resources).
# No task voluntarily suspends itself.
# There is some point in time, referred to as a critical instant, where all of the tasks become ready to execute simultaneously.
# Scheduling overheads (switching from one task to another) are zero.
# All tasks have zero release jitter (the time from the task arriving to it becoming ready to execute).
If restriction 7 is lifted, then "deadline minus jitter" monotonic priority assignment is optimal.
If restriction 1. is lifted allowing deadlines greater than periods, then Audsley's optimal priority assignment algorithm may be used to find the optimal priority assignment.
Deadline monotonic priority assignment is not optimal for fixed priority non-pre-emptive scheduling.
A fixed priority assignment policy P is referred to as optimal if no task set exists which is schedulable using a different priority assignment policy which is not also schedulable using priority assignment policy P. Or in other words: Deadline-monotonic priority assignment (DMPA) policy is optimal if any process set, Q, that is schedulable by priority scheme, W, is also schedulable by DMPA〔

== References ==


抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Deadline-monotonic scheduling」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.